منابع مشابه
Non-uniform Cellular Automata
In this paper we begin the study the dynamical behavior of non-uniform cellular automata and compare it to the behavior of “classical” cellular automata. In particular we focus on surjectivity and equicontinuity.
متن کاملNon-Uniform Cellular Automata a Review Non-Uniform Cellular Automata a Review
This tutorial intends to present an introduction to non-uniform cellular automata (CA). The difference between uniform cellular automata and non-uniform ones is that in uniform CA all cells share the same rule, or set of rules, in non-uniform CA this is not true, every cell can have a different sets of rules or even no rule at all. We will see here that this single difference increases the powe...
متن کاملCo-Evolving Demes of Non-Uniform Cellular Automata for Synchronisation
Emergent computation refers to systems in which global information processing appears as a result of the interactions among many components, each of which may be a system that exhibits an ability for emergent computation at a different level of self-organisation. In this paper, we employ a modification of cellular programming to evolve cellular machines for synchronisation. This allows global c...
متن کاملLocal rule distributions, language complexity and non-uniform cellular automata
This paper investigates a variant of cellular automata, namely ν-CA. Indeed, ν-CA are cellular automata which can have di erent local rules at each site of their lattice. The assignment of local rules to sites of the lattice completely characterizes ν-CA. In this paper, sets of assignments sharing some interesting properties are associated with languages of bi-in nite words. The complexity clas...
متن کاملThree research directions in non-uniform cellular automata
The paper deals with recent developments about non-uniform cellular automata. After reviewing known results about structural stability we complete them by showing that also sensitivity to initial conditions is not structurally stable. The second part of the paper reports the complexity results about the main dynamical properties. Some proofs are shortened and clarified. The third part is comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.10.024